Hill Climbing Method Using Claus Model for Categorical Data
نویسندگان
چکیده
منابع مشابه
Boolean Function Design Using Hill Climbing Methods
This paper outlines a general approach to the iterative incremental improvement of the cryptographic properties of arbitrary Boolean functions. These methods, which are known as hill climbing, offer a fast way to obtain Boolean functions that have properties superior to those of randomly generated functions. They provide a means to improve the attainable compromise between conflicting cryptogra...
متن کاملProbabilistic Hill-climbing
Many learning tasks involve searching through a discrete space of performance elements, seeking an element whose future utility is expected to be high. As the task of nding the global optimum is often intractable, many practical learning systems use simple forms of hill-climbing to nd a locally optimal element. However, hill-climbing can be complicated by the fact that the utility value of a pe...
متن کاملStochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called “basin flooding”). We propose and evaluate a stochastic generalization of enforced hill-climbing for online use in goal-oriented probabilistic planning problems. We assume a provided heuristic function estimating expected cost to the goal with fla...
متن کاملA Hill - Climbing Approach for OptimizingClassi cation
We consider the problem of minimizing the expected cost of determining the correct value of a binary-valued function when it is costly to inspect the values of its arguments. This type of problem arises in distributed computing, in the design of diagnostic expert systems, in reliability analysis of multi-component systems, and in many other applications. Any feasible solution to the problem can...
متن کاملBetter Hill-Climbing Searches for Parsimony
The reconstruction of evolutionary trees is a major problem in biology, and many evolutionary trees are estimated using heuristics for the NP-hard optimization problem Maximum Parsimony. The current heuristics for searching through tree space use a particular technique, called “tree-bisection and reconnection”, or TBR, to transform one tree into another tree; other less-frequently used transfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics and Statistics
سال: 2009
ISSN: 1549-3644
DOI: 10.3844/jmssp.2009.375.378